Special issue on bioinformaticsZHU, Binhai.Journal of combinatorial optimization. 2007, Vol 13, Num 3, issn 1382-6905, 85 p.Serial Issue

A 2-approximation for the preceding-and-crossing structured 2-interval pattern problemMINGHUI JIANG.Journal of combinatorial optimization. 2007, Vol 13, Num 3, pp 217-221, issn 1382-6905, 5 p.Article

Selected Papers from COCOON 2003WARNOW, Tandy; ZHU, Binhai.Theoretical computer science. 2004, Vol 325, Num 3, issn 0304-3975, 146 p.Conference Proceedings

RNA multiple structural alignment with longest common subsequencesBEREG, Sergey; KUBICA, Marcin; WALEN, Tomasz et al.Journal of combinatorial optimization. 2007, Vol 13, Num 2, pp 179-188, issn 1382-6905, 10 p.Article

The complexity of Boolean matrix root computationKUTZ, Martin.Theoretical computer science. 2004, Vol 325, Num 3, pp 373-390, issn 0304-3975, 18 p.Conference Paper

Improved algorithms for largest cardinality 2-interval pattern problemERDONG CHEN; LINJI YANG; HAO YUAN et al.Journal of combinatorial optimization. 2007, Vol 13, Num 3, pp 263-275, issn 1382-6905, 13 p.Article

On product covering in 3-tier supply chain models : Natural complete problems for W[3] and W[4]JIANER CHEN; FENGHUI ZHANG.Theoretical computer science. 2006, Vol 363, Num 3, pp 278-288, issn 0304-3975, 11 p.Conference Paper

Efficient data mappings for parity-declustered data layoutsSCHWABE, Eric J; SUTHERLAND, Ian M.Theoretical computer science. 2004, Vol 325, Num 3, pp 391-407, issn 0304-3975, 17 p.Conference Paper

Approximate and dynamic rank aggregationCHINA, Francis Y. L; XIAOTIE DENG; QIZHI FANG et al.Theoretical computer science. 2004, Vol 325, Num 3, pp 409-424, issn 0304-3975, 16 p.Conference Paper

The structure and number of global roundings of a graphASANO, Tetsuo; KATOH, Naoki; TAMAKI, Hisao et al.Theoretical computer science. 2004, Vol 325, Num 3, pp 425-437, issn 0304-3975, 13 p.Conference Paper

Genomic distances under deletions and insertionsMARRON, Mark; SWENSON, Krister M; MORET, Bernard M. E et al.Theoretical computer science. 2004, Vol 325, Num 3, pp 347-360, issn 0304-3975, 14 p.Conference Paper

Fast algorithms for computing the tripartition-based distance between phylogenetic networksNGUYEN BAO NGUYEN; THACH NGUYEN, C; SUNG, Wing-Kin et al.Journal of combinatorial optimization. 2007, Vol 13, Num 3, pp 223-242, issn 1382-6905, 20 p.Article

Computation of arbitrage in frictional bond marketsCAI, Mao-Cheng; XIAOTIE DENG; ZHONGFEI LI et al.Theoretical computer science. 2006, Vol 363, Num 3, pp 248-256, issn 0304-3975, 9 p.Conference Paper

Improved algorithms for two single machine scheduling problemsYONG HE; WEIYA ZHONG; HUIKUN GU et al.Theoretical computer science. 2006, Vol 363, Num 3, pp 257-265, issn 0304-3975, 9 p.Conference Paper

Improved competitive algorithms for online scheduling with partial job valuesCHIN, Francis Y. L; FUNG, Stanley P. Y.Theoretical computer science. 2004, Vol 325, Num 3, pp 467-478, issn 0304-3975, 12 p.Conference Paper

A space-efficient algorithm for sequence alignment with inversions and reversalsCHEN, Zhi-Zhong; YONG GAO; GUOHUI LIN et al.Theoretical computer science. 2004, Vol 325, Num 3, pp 361-372, issn 0304-3975, 12 p.Conference Paper